Kriging-Weighted Laplacian Kernels for Grayscale Image Sharpening

نویسندگان

چکیده

Sharpening filters are used to highlight fine image details, including object edges. However, sharpening very specific different types of images as they may create undesired edge effects, over-highlight or emphasize noise. Laplacian, Laplacian Gaussian, high-boost, unsharp masking filters, and their extended algorithms among most widely spatial filters. This paper introduces a method that integrates anisotropic averaging with the kernels for grayscale sharpening. The proposed methodology is based on concept kriging computation in geostatistics determining optimal interpolation weights domain. convolution then carried out Experimental results suggest certain advantages linear model over masking, diffusion methods terms balance sharpness natural visualization. Another advantage it does not require any input statistical parameters.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Graph Laplacian and Image Inpainting

Abstract. Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy ...

متن کامل

Downscaling cokriging for image sharpening

The main aim of this paper is to show the utility of cokriging for image fusion (i.e. increasing the spatial resolution of satellite sensor images). It is assumed that co-registered images with different spatial and spectral resolutions of the same scene are available and the task is to generate new remote sensing images at the finer spatial resolution for the spectral bands available only at t...

متن کامل

Polynomial Kernels for Weighted Problems

Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations for Subset Sum and Knapsack when parameterized by the number n of items. We answer both questions affirmatively by using an algorithm for compr...

متن کامل

Discrete mixtures of kernels for Kriging-based optimization

Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set. Since choosing an unadapted kernel can radically harm the results, we wish to reduce the risk of model misspecification. Here we consider the simultaneous use of multiple kernels within Kriging. We give the equations o...

متن کامل

Topological operators for grayscale image processing

In a recent work, we introduced some topological notions for grayscale images based on a cross-section topology. In particular, the notion of destructible point, which corresponds to the classical notion of simple point, allows us to build operators that simplify a grayscale image while preserving its topology. In this paper, we introduce new notions and operators in the framework of the cross-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3178607